Antibandwidth and cyclic antibandwidth of Hamming graphs
نویسندگان
چکیده
منابع مشابه
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
The antibandwidth problem is to label vertices of graph G(V,E) bijectively by integers 0, 1, ..., |V |− 1 in such a way that the minimal difference of labels of adjacent vertices is maximised. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1Knk . We have exact values for special choices of ni’s and ...
متن کاملAntibandwidth and cyclic antibandwidth of meshes and hypercubes
The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximized. The problem was originally introduced in [15] in connection with multiprocessor scheduling problems and can be also understood as a dual problem to the well known bandwidth problem, as a special radiocolouring ...
متن کاملAntibandwidth of Bipartite Graphs
Let G = (V,E) be a graph with n vertices and f : V (G) → {1, 2, . . . , n} be a bijective function. We define the minimum edge difference as ab(G, f) = min{|f(u)− f(v)| : (u, v) ∈ E}. We say that f is a k-antibandwidth labeling on G if ab(G, f) ≥ k. Let ab(G) = maxf{ab(G, f)}. We therefore investigate the lower bound of ab(G). In other words, to what extent can we maximize the minimum edge diff...
متن کاملThe Cyclic Antibandwidth Problem
The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle Cn, such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a variant of obnoxious facility location problems or a dual problem to the cyclic bandwidth problem. The problem is NP-hard. In the paper we start investigating this invariant for typical graphs. We prove basic facts ...
متن کاملA hybrid metaheuristic for the cyclic antibandwidth problem
0950-7051/$ see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.knosys.2013.08.026 ⇑ Corresponding author. Tel.: +34 958244258; fax: +34 958 243317. E-mail addresses: [email protected] (M. Lozano), [email protected] (A. Duarte), [email protected] (F. Gortázar), [email protected] (R. Martí). Manuel Lozano a,⇑, Abraham Duarte , Francisco Gortázar , Raf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.12.026